DH-LRU: Dynamic Hybrid LRU Caching Scheme for PRAM/DRAM Hybrid Main Memory
نویسندگان
چکیده
منابع مشابه
Optimizing the LRU Algorithm for Web Caching
We analyze a class of randomized Least-Recently-Used (LRU) cache replacement algorithms under the independent reference model with generalized Zipf’s law request probabilities. The randomization was recently proposed for Web caching as a mechanism that discriminates between different document sizes. In particular, a requested document that is not found in the cache either replaces a necessary n...
متن کاملOptimizing LRU Caching for Variable Document Sizes
We analyze a class of randomized Least-Recently-Used (LRU) cache replacement algorithms under the independent reference model with generalized Zipf’s law request probabilities. The randomization was recently proposed for Web caching as a mechanism that discriminates between different document sizes. In particular, the cache maintains an ordered list of documents in the following way. When a doc...
متن کاملLRU-SP: A Size-Adjusted and Popularity-Aware LRU Replacement Algorithm for Web Caching
This paper presents LRU-SP, a size-adjusted and popularity-aware extension to Least Recently Used (LRU) for caching web objects. The standard LRU, focusing on recently used and equal sized objects, is not suitable for the web context because web objects vary dramatically in size and the recently accessed objects may possibly differ from popular ones. LRU-SP is built on two LRU extensions, namel...
متن کاملLRU Caching with Moderately Heavy Request Distributions
Majority of practical caching algorithms, in particular those used in the World Wide Web applications, are based on the so-called Least-Recently-Used (LRU) cache replacement heuristic whose desirable attributes include low complexity, quick adaptability and high cache hit (low fault) probability. Recent studies have developed asymptotic characterization of the LRU fault probability for the gene...
متن کاملAsymptotic Miss Ratio of LRU Caching with Consistent Hashing
To efficiently scale data caching infrastructure to support emerging big data applications, many caching systems rely on consistent hashing to group a large number of servers to form a cooperative cluster. These servers are organized together according to a random hash function. They jointly provide a unified but distributed hash table to serve swift and voluminous data item requests. Different...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Grid and Distributed Computing
سال: 2016
ISSN: 2005-4262,2005-4262
DOI: 10.14257/ijgdc.2016.9.11.07